Lecture 9: Binary tree basics

Binary Tree Basics

Binary Tree Definition

• Every node has at most two children a left child and a right child.

• Root - the top most node in a tree.

A Basic Tree Structure

• A node having no child is a leaf.

Depth of a node

• The length of the path from the root to the node.

• Depth(root)=0

Height of the tree

• The height of a node is the length of the longest downward path between the node and a leaf + 1.

• The height of a node is the length of the longest downward path between the root and a leaf +1.

Depth and height

Full Binary Tree

• Every node has 2 children except the leaves.

Complete Binary Tree

• A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.

• A fully complete binary tree has n nodes what is the height of the tree?

O(log n)

• A fully complete binary tree has n nodes what are the number of leaves in the tree?

Ceil(n/2)

Implementation

Search an element in binary tree

Sum of all the nodes of the tree

Inorder traversal

• Visit the left subtree first• Visit the node.• Visit the right subtree.

Postorder traversal

• Visit the left subtree first• Visit the right subtree• Visit the node.

Preorder traversal

• Visit the node.• Visit the left subtree first• Visit the right subtree.

Vector

vector<int> a;a.push_back(value);cout<<a[i]<<endl;Accessing the pushed back value similar to an

array.(REST READ FROM NET)

Oj.leetcode.com

https://oj.leetcode.com/problems/binary-tree-postorder-traversal/https://oj.leetcode.com/problems/binary-tree-preorder-traversal/https://oj.leetcode.com/problems/balanced-binary-tree/https://oj.leetcode.com/problems/balanced-binary-tree/

• https://oj.leetcode.com/problems/binary-tree-level-order-traversal/

• https://oj.leetcode.com/problems/binary-tree-inorder-traversal/

• https://oj.leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/

• https://oj.leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/

Lecture 9: Binary tree basics

Engineering

Transcript of Lecture 9: Binary tree basics

(Binary tree)

Topic 15 The Binary Search Tree ADT. 11-2 Binary Search Tree A binary search tree (BST) is a binary tree with an ordering property of its elements, such.

Binary Tree

A Binary Tree

Trees - KU ITTCkulkarni/teaching/EECS268/slides/chap10-part1.pdf · • Binary tree traversals • Representations of a binary tree • Binary tree ADT • Binary search tree EECS

Binary Tree Illustrated

Binary Tree Representation

1 Trees 3: The Binary Search Tree Section 4.3. 2 Binary Search Tree A binary tree B is called a binary search tree iff: –There is an order relation

THREADED BINARY TREE AND BINARY SEARCH TREE

Traversing a Binary Tree Binary Search Tree Insertion Deleting from a Binary Search Tree

11.2 Tree Binary Tree

Binary Trees - Pepperdine University · The formal deﬁnition of a binary tree is recursive. • An empty tree is a binary tree. • Anonempty binary tree has three parts: – a

02. Binary Tree

Trees 3 The Binary Search Tree Section 4.3. Binary Search Tree Also known as Totally Ordered Tree Definition: A binary tree B is called a binary search.

1 Trees. 2 Outline –Tree Structures –Tree Node Level and Path Length –Binary Tree Definition –Binary Tree Nodes –Binary Search Trees.

Threaded Binary Tree

Unit4 Binary Tree

Binary Tree Iterators and Properties Displayable …...Binary Tree iterators Another induction example WA4 hints, questions Displayable Binary Trees # of nodes in Binary tree with

Binary Search Tree

Binary Search Trees. Understand tree terminology Understand and implement tree traversals Define the binary search tree property Implement binary.