Computer notes - Operations on Binary Tree

Class No.12

Data Structures

http://ecomputernotes.com

Operations on Binary Tree

There are a number of operations that can be defined for a binary tree.

If p is pointing to a node in an existing tree then left(p) returns pointer to the left subtree right(p) returns pointer to right subtree parent(p) returns the father of p brother(p) returns brother of p. info(p) returns content of the node.

Operations on Binary Tree

In order to construct a binary tree, the following can be useful:

setLeft(p,x) creates the left child node of p. The child node contains the info ‘x’.

setRight(p,x) creates the right child node of p. The child node contains the info ‘x’.

Applications of Binary Trees

A binary tree is a useful data structure when two-way decisions must be made at each point in a process.

For example, suppose we wanted to find all duplicates in a list of numbers:

14, 15, 4, 9, 7, 18, 3, 5, 16, 4, 20, 17, 9, 14, 5

Applications of Binary Trees

One way of finding duplicates is to compare each number with all those that precede it.

14, 15, 4, 9, 7, 18, 3, 5, 16, 4, 20, 17, 9, 14, 5

Searching for Duplicates

If the list of numbers is large and is growing, this procedure involves a large number of comparisons.

A linked list could handle the growth but the comparisons would still be large.

The number of comparisons can be drastically reduced by using a binary tree.

The tree grows dynamically like the linked list.

The binary tree is built in a special way. The first number in the list is placed in a

node that is designated as the root of a binary tree.

Initially, both left and right subtrees of the root are empty.

We take the next number and compare it with the number placed in the root.

If it is the same then we have a duplicate.http://ecomputernotes.com

Otherwise, we create a new tree node and put the new number in it.

The new node is made the left child of the root node if the second number is less than the one in the root.

The new node is made the right child if the number is greater than the one in the root.

14, 15, 4, 9, 7, 18, 3, 5, 16, 4, 20, 17, 9, 14, 5

15, 4, 9, 7, 18, 3, 5, 16, 4, 20, 17, 9, 14, 5

4, 9, 7, 18, 3, 5, 16, 4, 20, 17, 9, 14, 5

9, 7, 18, 3, 5, 16, 4, 20, 17, 9, 14, 5

7, 18, 3, 5, 16, 4, 20, 17, 9, 14, 5

18, 3, 5, 16, 4, 20, 17, 9, 14, 5

3, 5, 16, 4, 20, 17, 9, 14, 5

5, 16, 4, 20, 17, 9, 14, 5

16, 4, 20, 17, 9, 14, 5

4, 20, 17, 9, 14, 5

20, 17, 9, 14, 5

17, 9, 14, 5

9, 14, 5

C++ Implementation

#include <stdlib.h>template <class Object>class TreeNode { public: // constructors TreeNode() { this->object = NULL; this->left = this->right = NULL; }; TreeNode( Object* object ) { this->object = object; this->left = this->right = NULL; };

C++ ImplementationObject* getInfo() {

return this->object; };void setInfo(Object* object) {

this->object = object; };TreeNode* getLeft() {

return left; };void setLeft(TreeNode *left) {

this->left = left; };

C++ Implementation

TreeNode *getRight() {

return right; };void setRight(TreeNode *right) {

this->right = right; }; int isLeaf( ){

if( this->left == NULL && this->right == NULL ) return 1;

return 0;};

C++ Implementation

private:

Object* object;

TreeNode* left;

TreeNode* right;

}; // end class TreeNode

C++ Implementation

#include <iostream>#include <stdlib.h>#include "TreeNode.cpp"

int main(int argc, char *argv[]){

int x[] = { 14, 15, 4, 9, 7, 18, 3, 5, 16,4, 20, 17, 9, 14,5, -1};

TreeNode<int>* root = new TreeNode<int>();root->setInfo( &x[0] );for(int i=1; x[i] > 0; i++ ){

insert(root, &x[i] );}

C++ Implementation

void insert(TreeNode<int>* root, int* info){ TreeNode<int>* node = new TreeNode<int>(info); TreeNode<int> *p, *q; p = q = root; while( *info != *(p->getInfo()) && q != NULL ) { p = q; if( *info < *(p->getInfo()) ) q = p->getLeft(); else q = p->getRight(); }

C++ Implementation

if( *info == *(p->getInfo()) ){

cout << "attempt to insert duplicate: "

<< *info << endl;

delete node;

else if( *info < *(p->getInfo()) )

p->setLeft( node );

p->setRight( node );

} // end of insert

Trace of insert

17, 9, 14, 5

Trace of insert

17, 9, 14, 5

Trace of insert

17, 9, 14, 5

Trace of insert

17, 9, 14, 5

Trace of insert

17, 9, 14, 5

Trace of insert

17, 9, 14, 5

Trace of insert

17, 9, 14, 5

Trace of insert

17, 9, 14, 5

Trace of insert

17, 9, 14, 5

p->setRight( node );

Computer notes - Operations on Binary Tree

Education

Transcript of Computer notes - Operations on Binary Tree

Traversing a Binary Tree Binary Search Tree Insertion Deleting from a Binary Search 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

Review Binary Tree Binary Tree Representation Array Representation Link List Representation Operations on Binary Trees Traversing Binary Trees Pre-Order.

3.2 BINARY SEARCH TREES BSTs ordered operations deletionA BST is a binary tree in symmetric order. ... THE RESULTS A binary search tree is a binary tree to each node of which we have

Balanced Binary Search Trees A binary search tree can implement any of the basic dynamic-set operations in O(h) time. These operations are O(lgn) if tree.

Binary search trees Definition Binary search trees and dynamic set operations Balanced binary search trees –Tree rotations –Red-black trees Move to front.

Binary Tree

Chapter 5 Trees: Outline Introduction Representation Of Trees Binary Trees Binary Tree Traversals Additional Binary Tree Operations Threaded.

Qamar Abbas Binary Search Tree 1. Binary Search Trees Support many dynamic set operations SEARCH, MINIMUM, MAXIMUM, PREDECESSOR, SUCCESSOR, INSERT Running.

Binary Search Trees - cse.unl.educse.unl.edu/~sscott/teach/Classes/cse156F06/Notes/09.search_trees.pdf · Binary Search Trees 2 Binary Search Tree Operations • Given a binary search

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

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

THREADED BINARY TREE AND BINARY SEARCH TREE

BSCE- 2201 ENGINEERING MATHEMATICS III · Representation of Symbol Tables- Static Tree Table and Dynamic Tree Table, Binary Search Tree and its operations, Binary Search Trees as

3.2 BINARY SEARCH TREES BSTs ordered operations …algs4.cs.princeton.edu/lectures/32BinarySearchTrees.pdf · A binary search tree is a binary tree to each node of which we have associated

BIKANER TECHNICAL UNIVERSITY BIKANERinformation and document design, Strategies for organization, ... Definition of tree, Properties of tree, Binary Tree, ... Operations on a Binary

Binary Search Tree Binary Search Tree 1 Kabo's visualization

Binary Tree Robb T. Binary Tree Implementationpeople.hsc.edu/faculty-staff/robbk/Coms262/Lectures/Spring 2009... · Binary Tree Implementa-tion Robb T. Koether The Binary Tree Interface

Rooted tree and binary tree

Preview Graph Tree Binary Tree Binary Search Tree Binary Search Tree Property Binary Search Tree functions In-order walk Pre-order walk Post-order.