aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Data Structure (UGC/ NET)
  • Which of the following forms of tree has only left subtree?
Multiple choice

Which of the following forms of tree has only left subtree?

  1. Full binary tree

  2. Complete binary tree

  3. Left skewed tree

  4. Binary tree

  5. Forest

Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

A tree which is having only left subtree is called as left skewed tree.

Keep practicing — related questions

  • Which of the following forms of binary tree is the one in which every non-leaf node has non-empty left and ...
  • In which of the following binary trees is every level, except possibly the last, completely filled?
  • In which tree, for every node the heights of its left sub-tree and right sub-tree differ at least by one?
  • In which of the following data structures, every level, except possibly the last, is totally filled, and al...
  • A type of binary tree in which all levels except possibly the last are full, and the last level has all its...
  • A binary tree whose every node has either zero or two children is called
  • If a binary tree contains either two or zero children, then it is called as
  • How many number of nodes are used in a FULL BINARY TREE of depth 5 with no children (from right to left) ?
Play the full quiz 🎤 Practise this topic out loud

Practice this topic

  • Data Structures and Algorithms (1518 questions)
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy