A binary tree whose every node has either zero or two children is called Data Structures 4 May 20204 May 2020StudyBlocksLeave a Comment on A binary tree whose every node has either zero or two children is calleda) Complete binary treeb) Binary search treec) Extended binary treed) None of above