mirror of
https://github.com/TheAlgorithms/Java.git
synced 2026-03-13 08:40:43 +08:00
style: enable InvalidJavadocPosition in checkstyle (#5237)
enable style InvalidJavadocPosition Co-authored-by: Samuel Facchinello <samuel.facchinello@piksel.com>
This commit is contained in:
committed by
GitHub
parent
39e065437c
commit
74e51990c1
@@ -18,8 +18,6 @@ import com.thealgorithms.datastructures.trees.BinaryTree.Node;
|
||||
*
|
||||
* Ex.2. [30,20,40,10,25,35,50] represents level order traversal of a binary
|
||||
* search tree. Find ceil for 52 Answer: -1
|
||||
*/
|
||||
/**
|
||||
*
|
||||
* Solution 1: Brute Force Solution: Do an inorder traversal and save result
|
||||
* into an array. Iterate over the array to get an element equal to or greater
|
||||
|
||||
@@ -1,12 +1,12 @@
|
||||
package com.thealgorithms.datastructures.trees;
|
||||
|
||||
import java.util.Scanner;
|
||||
|
||||
/**
|
||||
* Trie Data structure implementation without any libraries
|
||||
*
|
||||
* @author Dheeraj Kumar Barnwal (https://github.com/dheeraj92)
|
||||
* @author <a href="https://github.com/dheeraj92">Dheeraj Kumar Barnwal</a>
|
||||
*/
|
||||
import java.util.Scanner;
|
||||
|
||||
public class TrieImp {
|
||||
|
||||
public class TrieNode {
|
||||
|
||||
Reference in New Issue
Block a user