Which of the following statements hold true for binary trees?

Options
- The left subtree of a node contains only nodes with keys less than the node's key
- The right subtree of a node contains only nodes with keys greater than the node's key.
- Both a and b
- Noth left and right subtree nodes contains only nodes with keys less than the node's key

CORRECT ANSWER : Both a and b

Discussion Board
DATA STRUCTURE-BINARY TREE

all BST ARE BINARY TREE BUT ALL BINARY TREES ARE NOT BST

RASHMI SARMA 09-21-2017 02:15 AM

Data Structure - Binary Search Tree

Binary search tree is a binary tree which has special property called BST, where each node contains only smaller values in its left subtree and only larger values in its right subtree.

Prajakta Pandit 01-31-2017 02:24 AM

BST

BST bears this character.

jian 06-13-2014 08:32 AM

Binary Search Tree (BST)

It should be a Binary Search Tree (BST), right?

wuyi12345 09-3-2013 10:12 PM

Write your comments


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)


Related Content

Advertisement
 
▲